Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY
نویسندگان
چکیده
The goal of this paper is to prove that the implementation of Taylor models in COSY, based on floating-point arithmetic, computes results satisfying the “containment property”, i.e. guaranteed results. First, Taylor models are defined and their implementation in the COSY software by Makino and Berz is detailed. Afterwards IEEE-754 floating-point arithmetic is introduced. Then the core of this paper is given: the algorithms implemented in COSY for multiplying a Taylor model by a scalar, for adding or multiplying two Taylor models are given and are proven to return Taylor models satisfying the containment property. © 2004 Elsevier Inc. All rights reserved.
منابع مشابه
Rigorous High Precision Interval Arithmetic in COSY INFINITY
In this paper we present our implementation of a complete multiple machine precision interval package in FORTRAN 77. The operations are designed to perform optimally with up to about 100 significant digits. The implementation only requires IEEE 754 compliant floating point operations, and thus is highly portable to virtually any modern computer platform. Intervals are stored as unevaluated floa...
متن کاملRepresentable Correcting Terms for Possibly Underflowing Floating Point Operations
Studying floating point arithmetic, authors have shown that the implemented operations (addition, subtraction, multiplication, division and square root) can compute a result and an exact correcting term using the same format as the inputs. Following a path initiated in 1965, many authors supposed that neither underflow nor overflow occurred in the process. Overflow is not critical as this kind ...
متن کاملDesign and Implementation of a High Precision Arithmetic with Rigorous Error Bounds
In this paper we present the design of a rigorous, high precision floating point arithmetic. The algorithms presented are implementation in FORTRAN, and are made available through the COSY INFINITY rigorous computation package. The three design objectives for these high precision intervals are high speed, particularly for the elementary operations, absolutely rigorous treatment of roundoff erro...
متن کاملASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm
Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...
متن کاملImplementing Taylor models arithmetic with floating-point arithmetic
The implementation of Taylor models arithmetic may use floating-point arithmetic to benefit from the speed of the floatingpoint implementation. The issue is then to take into account the roundoff errors. Here, we assume that the floating-point arithmetic is compliant with the IEEE-754 standard. We show how to get tight bounds of the roundoff errors, and more generally how to get high accuracy f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Algebr. Program.
دوره 64 شماره
صفحات -
تاریخ انتشار 2005